Generalized Rewrite Theories and Coherence Completion
نویسنده
چکیده
A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing the standard notion in [3] is motivated and defined. Also, new requirements for symbolic executability of generalized rewrite theories that extend those in [8] for standard rewrite theories, including a generalized notion of coherence, are given. Finally, symbolic executability, including coherence, is both ensured and made available for a wide class of such theories by automatable theory transformations.
منابع مشابه
Husserl and Hilbert on Completeness and Husserl's Term Rewrite-based Theory of Multiplicity (Invited Talk)
Hilbert and Husserl presented axiomatic arithmetic theories in different ways and proposed two different notions of “completeness” for arithmetic, at the turning of the 20th Century (1900– 1901). The former led to the completion axiom, the latter completion of rewriting. We look into the latter in comparison with the former. The key notion to understand the latter is the notion of definite mult...
متن کاملCategorification, Term Rewriting and the Knuth–bendix Procedure
An axiomatization of a finitary, equational universal algebra by a convergent term rewrite system gives rise to a finite, coherent categorification of the algebra.
متن کاملA Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories (Long Version)
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E modulo A. The correctness of many important formal verification tasks, including search, LTL model checking, and the development of abstractions, crucially depends on the theory being ground coherent. Furthermore, many ...
متن کاملA Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E modulo A. The correctness of many important formal verification tasks, including search, LTL model checking, and the development of abstractions, crucially depends on the theory being ground coherent. Furthermore, many ...
متن کاملNormalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations
In a rst part, we introduce normalized rewriting, a new rewrite relation. It generalizes former notions of rewriting modulo a set of equations E, dropping some conditions on E. For example, E can now be the theory of identity, idempotence, the theory of Abelian groups or the theory of commutative rings. We give a new completion algorithm for normalized rewriting. It contains as an instance the ...
متن کامل